Some Sofic Shifts Cannot Commute with Nonwandering Shifts of Finite Type
نویسندگان
چکیده
Suppose S is a nonwandering shift of finite type (SFT), and T is an expansive automorphism of S. We show T cannot be a strictly sofic almost Markov shift. Also included is an example of D. Fiebig, a reducible SFT with an expansive automorphism which is not SFT.
منابع مشابه
Finite-type-Dyck shift spaces
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck shifts into a sequence of Dyck splittings and amalgamations.
متن کاملSofic and Almost of Finite Type Tree-Shifts
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of infinite sequences, there is no unique minimal deterministic irreducible tree automaton accepting an irreducible sofic tree-shift, but that there is a unique synchronized one, called the Shannon cover of the tree-shi...
متن کاملMultidimensional Sofic Shifts without Separation and Their Factors
For d ≥ 2 we exhibit mixing Z shifts of finite type and sofic shifts with large entropy but poorly separated subsystems (in the sofic examples, the only minimal subsystem is a single point). These examples consequently have very constrained factors; in particular, no non-trivial full shift is a factor. We also provide examples to distinguish certain mixing conditions, and develop the natural cl...
متن کاملOn Flow Equivalence of Sofic Shifts
The flow equivalence of sofic shifts is examined using results about the structure of the corresponding covers. A canonical cover generalising the left Fischer cover to arbitrary sofic shifts is introduced and used to prove that the left Krieger cover and the past set cover of a sofic shift can be divided into natural layers. These results are used to find the range of a flow invariant and to i...
متن کاملA hierarchy of shift equivalent sofic shifts
We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the shifts. We prove that these classes define invariants shift equivalence (and thus for conjugacy). Finally, we...
متن کامل